A Fast Dual Algorithm for Kernel Logistic Regression
نویسندگان
چکیده
منابع مشابه
Kernel Logistic Regression Algorithm for Large-Scale Data Classification
Kernel Logistic Regression (KLR) is a powerful classification technique that has been applied successfully in many classification problems. However, it is often not found in large-scale data classification problems and this is mainly because it is computationally expensive. In this paper, we present a new KLR algorithm based on Truncated Regularized Iteratively Reweighted Least Squares(TR-IRLS)...
متن کاملSparse Bayesian kernel logistic regression
In this paper we present a simple hierarchical Bayesian treatment of the sparse kernel logistic regression (KLR) model based MacKay’s evidence approximation. The model is re-parameterised such that an isotropic Gaussian prior over parameters in the kernel induced feature space is replaced by an isotropic Gaussian prior over the transformed parameters, facilitating a Bayesian analysis using stan...
متن کاملFast Algorithm for Logistic Bandit
We study a logistic bandit problem and propose an algorithm that enjoys fast update. In our problem, each round the learner first chooses an arm from a decision set, in which each arm is associated with a feature vector. Then, she receives a reward, which is binary and is generated by a logistic function. Our algorithm for the problem can be seen as a marriage between stochastic gradient descen...
متن کاملFast “dropout” training for logistic regression
Recently, improved classification performance has been achieved by encouraging independent contributions from input features, or equivalently, by preventing feature co-adaptation. In particular, the method proposed in [1], informally called “dropout”, did this by randomly dropping out (zeroing) hidden units and input features for training neural networks. However, sampling a random subset of in...
متن کاملA Fast Trust-Region Newton Method for Softmax Logistic Regression
With the emergence of big data, there has been a growing interest in optimization routines that lead to faster convergence of Logistic Regression (LR). Among many optimization methods such as Gradient Descent, Quasi-Newton, Conjugate Gradient, etc., the Trust-region based truncated Newton method (TRON) algorithm has been shown to converge the fastest. The TRON algorithm also forms an important ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2005
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-005-0768-5